A Neural Network — Based Optimization Algorithm for the Weapon-Target Assignment Problem

A neural network-based algorithm was developed for the Weapon-Target Assignment Problem (WTAP) in Ballistic Missile Defense (BMD). An optimal assignment policy is one which allocates targets to weapon platforms such that the total expected leakage value of targets surviving the defense is minimized. This involves the minimization of a non-linear objective function subject to inequality constraints specifying the maximum number of interceptors available to each platform and the maximum number of interceptors allowed to be fired at each target as imposed by the Battle Management/Command Control and Communications (BM/C) system. The algorithm consists of solving a system of ODEs trajectories and variables. Simulations of the algorithm on PC and VAX computers were carried out using a simple numerical scheme. In all the battle instances tested, the algorithm has proven to be stable and to converge to solutions very close to global optima. The time to achieve convergence was consistently less than the time constant of the network's processing elements (neurons). This implies that fast solutions can be realized if the algorithm is implemented in hardware circuits. Three series of battle scenarios are analyzed and discussed in this report. Input data and results axe presented in detail. The main advantage of this algorithm is that it can be adapted to either a special-purpose hardware circuit or a general-purpose concurrent machine to yield fast and accurate solutions to difficult decision problems. vii Preceding page blank